A pervasively verifiable online voting scheme

نویسندگان

  • Lucie Langer
  • Axel Schmidt
  • Roberto Araújo
چکیده

We present an improvement of Ohkubo et al.’s e-voting protocol [OMA99]: We provide that the validator’s signature is attached directly to the vote although the vote has been encrypted before. Thus verifiability does not end before tallying like in the original scheme but is pervasive even beyond the end of the election. This prevents manipulation of the plaintext votes and offers verifiability to the public instead of restricting it to the talliers. Moreover, privacy can be ensured without using blind signatures, which facilitates receipt-freeness. Our variant of the scheme also allows the voter to seemingly comply with the demand of a coercer while actually casting the vote she intended.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Efficient Homomorphic Coercion Resistant and E2E Verifiable Voting Scheme

This paper proposes a voting scheme that coalesces many features of an efficient e-voting scheme like receipt-freeness, uncoercibility, E2E verifiable and write-in ballot. Some of the previous schemes in the past literatures provide most of these features at the cost of increased running time. This paper proposes a simple and efficient voting scheme that is coercion resistant and E2E verifiable...

متن کامل

A Fast Publicly Verifiable Secret Sharing Scheme using Non-homogeneous Linear Recursions

A non-interactive (t,n)-publicly veriable secret sharing scheme (non-interactive (t,n)-PVSS scheme) is a (t,n)-secret sharing scheme in which anyone, not only the participants of the scheme, can verify the correctness of the produced shares without interacting with the dealer and participants. The (t,n)-PVSS schemes have found a lot of applications in cryptography because they are suitable for<...

متن کامل

An Efficient Threshold Verifiable Multi-Secret Sharing Scheme Using Generalized Jacobian of Elliptic Curves

‎In a (t,n)-threshold secret sharing scheme‎, ‎a secret s is distributed among n participants such that any group of t or more participants can reconstruct the secret together‎, ‎but no group of fewer than t participants can do‎. In this paper, we propose a verifiable (t,n)-threshold multi-secret sharing scheme based on Shao and Cao‎, ‎and the intractability of the elliptic curve discrete logar...

متن کامل

Convertible limited (multi-) verifier signature: new constructions and applications

A convertible limited (multi-) verifier signature (CL(M)VS) provides controlled verifiability and preserves the privacy of the signer. Furthermore, limited verifier(s) can designate the signature to a third party or convert it into a publicly verifiable signature upon necessity. In this proposal, we first present a generic construction of convertible limited verifier signature (CLVS) into which...

متن کامل

Receipt-Free Universally-Verifiable Voting with Everlasting Privacy

We present the first universally verifiable voting scheme that can be based on a general assumption (existence of a non-interactive commitment scheme). Our scheme is also the first receipt-free scheme to give “everlasting privacy” for votes: even a computationally unbounded party does not gain any information about individual votes (other than what can be inferred from the

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008